A Generalization of BIAS Speci cations

نویسندگان

  • Evgenija D. Popova
  • Christian P. Ullrich
چکیده

This paper generalizes the speciication of Basic Interval Arithmetic Sub-routines (BIAS) to support interval arithmetic on directed (i.e. proper and improper) intervals. This is due to our understanding that the arithmetic involving improper intervals will be increasingly used in future applications and the corresponding interval arithmetic implementations require no additional cost. We extend BIAS speciication to be suuciently precise and complete, to include everything a user needs, such as subroutine's purpose, name, method of invocation and details of its behaviour and communication with the environment. The speciied interval arithmetic subroutines for directed intervals are consistent with conventional interval arithmetic and IEEE oating-point arithmetic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Speci cations and Sequencing: A Defect Detection Method

One class of program defects results from illegal sequences of otherwise legal operations in software implementations. Explicit statement of sequencing constraints, however, is not a common activity when specifying software even when using formal speci cation methods. This paper shows that constraints on program execution sequences can be derived directly from algebraic speci cations. Results i...

متن کامل

Generalizing BIAS Speci cations

This paper generalizes the speci cation of Basic Interval Arithmetic Subroutines (BIAS) to support interval arithmetic on directed (i.e. proper and improper) intervals. This is due to our understanding that the arithmetic involving improper intervals will be increasingly used in future applications and the corresponding interval arithmetic implementations require no additional cost. We extend B...

متن کامل

Re nement of Mixed Speci cations : AGeneralization of UNITYBeverly

Data reenement is an important and widely used technique for program development. In this paper, we give predicate transformer based semantics and reenement rules for mixed speciications that allow specii-cations to be written as a combination of abstract program and temporal properties. Mixed speciications may be considered a generalization of the UNITY speciication notation to allow safety pr...

متن کامل

Transformations in High-level Synthesis: Formal Speciication and Eecient Mechanical Veriication

Dependency graphs are used to model data and control ow in hardware and software design. In high-level synthesis of hardware, optimization and re nement transformations are used to transform dependency-graph-based speci cations at the behavior level to dependency-graph-based implementations at the register-transfer level. Registertransfer-level implementations are mapped to gate-level hardware ...

متن کامل

Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results

We study the complexity of various combinatorial problems when instances are speci ed using one of the following succinct speci cations: (1) the 1-dimensional nite periodic narrow speci cations (denoted 1-FPN-speci cations) of Ford et al. and Wanke [FF58, Wa93]; (2) the 1-dimensional nite periodic narrow speci cations with explicit boundary conditions (denoted 1-FPN(BC)-speci cations) of Gale [...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995